منابع مشابه
Unfolding-based Partial Order Reduction
Partial order reduction (POR) and net unfoldings are two alternative methods to tackle statespace explosion caused by concurrency. In this paper, we propose the combination of both approaches in an effort to combine their strengths. We first define, for an abstract execution model, unfolding semantics parameterized over an arbitrary independence relation. Based on it, our main contribution is a...
متن کاملGuard - based Partial - Order Reduction ( Extended Version )
This paper aims at making partial-order reduction independent of the modeling language. To this end, we present a guard-based method which is a generalpurpose implementation of the stubborn set method. We approach the implementation through so-called necessary enabling sets and do-not-accord sets, and give an algorithm suitable for an abstract model checking interface. We also introduce necessa...
متن کاملStatic Partial Order Reduction
1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible execution orders. An impor t an t observ...
متن کاملCartesian Partial-Order Reduction
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semantics that reduces the amount of nondeterminism in concurrent programs by delaying unnecessary context switches. Using this semantics, we construct a novel dynamic partial-order reduction algorithm. The cartesian semant...
متن کاملApproximate Partial Order Reduction
We develop a partial order reduction method for labeled transition systems over metric spaces. We introduce the notion of ε-independent actions such that executing these actions in any order results in states that are close to each other. Then we define ε-equivalent action sequences that swap ε-independent action pairs. We present an algorithm to over-approximate the reach set of executions tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automated Software Engineering
سال: 2004
ISSN: 0928-8910
DOI: 10.1023/b:ause.0000038937.18006.3d